Two-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect

نویسندگان

چکیده مقاله:

This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associated with the machine purchase. Based on the made decisions, the second stage aims to schedule orders, while the objective is to minimize total tardiness costs. A dependent-chance programming (DCP) approach is used for the defuzzification of the proposed model. As the resulted formulation is a NP-hard problem, a branch and bound (B&B) algorithm with effective lower bound is developed. Moreover, a genetic algorithm (GA) is proposed to solve problems of large-sizes. The computational results reveal the high efficiency of the proposed methods, in particular the GA, to solve problems of large sizes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...

متن کامل

Parallel Machine Scheduling Problem

A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...

متن کامل

A Three-Stage Optimization Algorithm for the Stochastic Parallel Machine Scheduling Problem with Adjustable Production Rates

We consider a parallel machine scheduling problem with random processing/setup times and adjustable production rates. The objective functions to be minimized consist of two parts; the first part is related with the due date performance (i.e., the tardiness of the jobs), while the second part is related with the setting of machine speeds. Therefore, the decision variables include both the produc...

متن کامل

Fuzzy Programming Approach for a Multi-objective Single Machine Scheduling Problem with Stochastic Processing Time

This paper considers a fuzzy programming approach for a multi-objective single machine scheduling problem when processing times of jobs are normal random variables. The probabilistic problem is converted into an equivalent deterministic programming problem. Then the fuzzy programming technique has been applied to obtain a compromise solution. A numerical example demonstrates the feasibility of ...

متن کامل

A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

متن کامل

A Fuzzy Mixed-Integer Goal Programming Model for a Parallel Machine Scheduling Problem

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. At the end, the effectiveness of the pr...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 10  شماره 3

صفحات  16- 32

تاریخ انتشار 2017-08-31

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023